Cache Replacement Using Re-reference Interval Prediction with Adaptive Bypassing (RRIPAB)

A Dueling Segmented LRU Replacement Algorithm with Adaptive Bypassing

In this paper we present a high performance cache replacement algorithm called Dueling Segmented LRU replacement algorithm with adaptive Bypassing (DSB). The base algorithm is Segmented LRU (SLRU) replacement algorithm originally proposed for disk cache management. We introduce three enhancements to the base SLRU algorithm. First, a newly allocated line could be randomly promoted for better pro...

Analyzing Adaptive Cache Replacement Strategies

Adaptive Replacement Cache (Arc) and CLOCK with Adaptive Replacement (Car) are state-of-theart “adaptive” cache replacement algorithms invented to improve on the shortcomings of classical cache replacement policies such as Lru, Lfu and Clock. By separating out items that have been accessed only once and items that have been accessed more frequently, both Arc and Car are able to control the harm...

Supplementary Materials to Adaptive and Transparent Cache Bypassing for GPUs

ABSTRACT This document is the supplementary supporting file to the corresponding SC-15 conference paper titled Adaptive and Transparent Cache Bypassing for GPUs. In this document, we first show the experiment figures for the four extra GPU platforms that cannot fit into the original paper due to page limitation. We then show the simulation results for the hardware approach that attempts to redu...

Run-Time Cache Bypassing

Cache Replacement Policy Using Map-based Adaptive Insertion

In this paper, we propose a map-based adaptive insertion policy (MAIP) for a novel cache replacement. The MAIP estimates the data reuse possibility on the basis of data reuse history. To track data reuse history, the MAIP employs a bitmap data structure, which we call memory access map. The memory access map holds all memory accessed locations in a fixed sized memory area to detect the data reu...